21![Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1 2 Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1 2](https://www.pdfsearch.io/img/a474f6acc8f938e7738da9a6787f5757.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2016-07-19 07:32:17
|
---|
22![Algorithms against Anarchy: Understanding Non-Truthful Mechanisms ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur Algorithms against Anarchy: Understanding Non-Truthful Mechanisms ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur](https://www.pdfsearch.io/img/500dccdfd736704cd7c27f762cd1663f.jpg) | Add to Reading ListSource URL: paulduetting.comLanguage: English - Date: 2015-06-17 14:01:56
|
---|
23![CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014 CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014](https://www.pdfsearch.io/img/965d802d5632f3cf55c7cd4d9e6079b8.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-06-11 16:25:54
|
---|
24![Synchronous Counting and Computational Algorithm Design Danny Dolev School of Engineering and Computer Science, The Hebrew University of Jerusalem Synchronous Counting and Computational Algorithm Design Danny Dolev School of Engineering and Computer Science, The Hebrew University of Jerusalem](https://www.pdfsearch.io/img/24843b06aa169a7dc859ea70b607e3bc.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2015-09-16 05:51:42
|
---|
25![Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga?? Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??](https://www.pdfsearch.io/img/aad6274dfb628ff6cdad120b9d80aeff.jpg) | Add to Reading ListSource URL: www14.in.tum.deLanguage: English - Date: 2013-11-25 11:07:00
|
---|
26![Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨](https://www.pdfsearch.io/img/115b87af638e413ad02574b046d11c54.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2016-01-03 06:45:52
|
---|
27![Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email . Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email .](https://www.pdfsearch.io/img/e791e27dfddb2d0632e997678dbc9608.jpg) | Add to Reading ListSource URL: www.conference123.orgLanguage: English - Date: 2014-07-16 23:22:02
|
---|
28![1 A Randomized Multi-modulo RNS Architecture for Double-and-Add in ECC to prevent Power Analysis Side Channel Attacks Jude Angelo Ambrose† 1 A Randomized Multi-modulo RNS Architecture for Double-and-Add in ECC to prevent Power Analysis Side Channel Attacks Jude Angelo Ambrose†](https://www.pdfsearch.io/img/766fd4606476c3b1bf3c9b541a3627f6.jpg) | Add to Reading ListSource URL: www.inesc-id.ptLanguage: English - Date: 2013-12-23 08:24:26
|
---|
29![Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor† Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†](https://www.pdfsearch.io/img/5656a287559a98811946f4fea1c77250.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English - Date: 2010-04-08 04:06:04
|
---|
30![Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch](https://www.pdfsearch.io/img/4c659a7304edac0080f93f604f29c2a3.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2015-05-29 10:12:12
|
---|